Weak weight-semi-greedy Markushevich bases

The main purpose of this paper is to study weight-semi-greedy Markushevich bases, and in particular, find conditions under which such bases are weight-almost greedy. In context, we prove that, for a large class weights, the two notions equivalent. We also show that all weight semi-greedy truncation quasi-greedy weight-superdemocratic. above cases, bring context weights weak greedy Chebyshev algorithms—which frequently studied literature on approximation. course our work, new property arises naturally its relation with squeeze symmetric bidemocratic given. addition, some parameters involving thresholding Chebyshevian algorithms. Finally, give examples conditional weighted greedy-type study.